Gaining-Sharing Knowledge Based Algorithm for Solving Stochastic Programming Problems
نویسندگان
چکیده
This paper presents a novel application of metaheuristic algorithms for solving stochastic programming problems using recently developed gaining sharing knowledge based optimization (GSK) algorithm. The algorithm is on human behavior in which people gain and share their with others. Different types fractional are considered this study. augmented Lagrangian method (ALM) used to handle these constrained by converting them into unconstrained problems. Three examples from the literature transformed deterministic form chance-constrained technique. solved GSK results compared eight other state-of-the-art algorithms. obtained also optimal global solution quoted literature. To investigate performance real-world problem, solid fixed charge transportation problem examined, parameters as random variables. show that outperforms terms convergence, robustness, computational time, quality solutions.
منابع مشابه
Solving fuzzy stochastic multi-objective programming problems based on a fuzzy inequality
Probabilistic or stochastic programming is a framework for modeling optimization problems that involve uncertainty.In this paper, we focus on multi-objective linear programmingproblems in which the coefficients of constraints and the righthand side vector are fuzzy random variables. There are several methodsin the literature that convert this problem to a stochastic or<b...
متن کاملUsing Genetic Algorithm in Solving Stochastic Programming for Multi-Objective Portfolio Selection in Tehran Stock Exchange
Investor decision making has always been affected by two factors: risk and returns. Considering risk, the investor expects an acceptable return on the investment decision horizon. Accordingly, defining goals and constraints for each investor can have unique prioritization. This paper develops several approaches to multi criteria portfolio optimization. The maximization of stock returns, the pow...
متن کاملAn Algorithm for Solving Quadratic Programming Problems
Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraintsequalities are solved with the help of an algorithm, so that matrix inversion is avoided, because of the more convenient organization of the Calculus. Optimal solution is determined in a finite number of iteratio...
متن کاملOn solving stochastic linear programming problems
Solving a stochastic linear programming (SLP) problem involves selecting an SLP solver, transmitting the model data to the solver and retrieving and interpreting the results. After shortly introducing the SLP model classes in the first part of the paper we give a general discussion of these various facets of solving SLP problems. The second part consists of an overview on the model–solver conne...
متن کاملSolving Fractional Programming Problems based on Swarm Intelligence
This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers, materials & continua
سال: 2022
ISSN: ['1546-2218', '1546-2226']
DOI: https://doi.org/10.32604/cmc.2022.023126